Moore on Intention and Volition

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Volition and Physical Laws

The term "known laws of physics" is meant to include any of the theoretical machinery used in unified field theory and string theory, even though these subjects are in an unfinished state. This theoretical machinery uses the same basic concepts-space, time, mass, interaction strength-as the present body of physics and does not make any assertions about consciousness. The concept of free will is...

متن کامل

ON THE CAPACITY OF EILENBERG-MACLANE AND MOORE SPACES

K. Borsuk in 1979, at the Topological Conference in Moscow, introduced concept of the capacity of a compactum and asked some questions concerning properties of the capacity ofcompacta. In this paper, we give partial positive answers to three of these questions in some cases. In fact, by describing spaces homotopy dominated by Moore and Eilenberg-MacLane spaces, the capacities of a Moore space $...

متن کامل

Volition and imagery in neurorehabilitation.

New interventional approaches have been proposed in the last few years to treat the motor deficits resulting from brain lesions. Training protocols represent the gold-standard of these approaches. However, the degree of motor recovery experienced by most patients remains incomplete. It would be important to improve our understanding of the mechanisms underlying functional recovery. This chapter...

متن کامل

On Moore bipartite digraphs

In the context of the degree/diameter problem for directed graphs, it is known that the number of vertices of a strongly connected bipartite digraph satisfies a Moore-like bound in terms of its diameter k and the maximum out-degrees (d1; d2) of its partite sets of vertices. It has been proved that, when d1d2 > 1, the digraphs attaining such a bound, called Moore bipartite digraphs, only exist w...

متن کامل

On Boyer-Moore Preprocessing

Probably the two best-known exact string matching algorithms are the linear-time algorithm of Knuth, Morris and Pratt (KMP), and the fast on average algorithm of Boyer and Moore (BM). The efficiency of these algorithms is based on using a suitable failure function. When a mismatch occurs in the currently inspected text position, the purpose of a failure function is to tell how many positions th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: University of Pennsylvania Law Review

سال: 1994

ISSN: 0041-9907

DOI: 10.2307/3312467